Dynamic bi-product bundle pricing problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Data Mining Framework for Product Bundle Design and Pricing

..................................................................................................................... vi ACKNOWLEDGEMENTS ............................................................................................. vii CHAPTER

متن کامل

On the complexity of a bundle pricing problem

We consider the problem of pricing items in order to maximize the revenue obtainable from a set of single minded customers. We relate the tractability of the problem to structural properties of customers’ valuations: the problem admits an efficient approximation algorithm, parameterized along the inhomogeneity of the valuations.

متن کامل

An Optimal Control Problem of Dynamic Pricing

An optimal control problem of dynamic pricing is studied. In the model, prices are chosen to sell multiple products to multiple customer classes over time. The products share a number of scarce resources. All parameters, such as the arrival rates of customers, their purchasing probabilities, their cancellation rates, and the cancellation refunds, are allowed to be time dependent. A solution met...

متن کامل

Considering Pricing Problem in a Dynamic and Integrated Design of Sustainable Closed-loop Supply Chain Network

Flexible and dynamic supply chain network design problem has been studied by many researchers during past years. Since integration of short-term and long-term decisions in strategic planning leads to more reliable plans, in this paper a multi-objective model for a sustainable closed-loop supply chain network design problem is proposed. The planning horizon of this model contains multiple strate...

متن کامل

Bundle Pricing with Comparable Items

We consider a revenue maximization problem where we are selling a set of items, each available in a certain quantity, to a set of bidders. Each bidder is interested in one or several bundles of items. We assume the bidders’ valuations for each of these bundles to be known. Whenever bundle prices are determined by the sum of single item prices, this algorithmic problem was recently shown to be i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Engineering Management and Competitiveness

سال: 2014

ISSN: 2334-9638

DOI: 10.5937/jemc1401047r